Lecturer: Madhu Sudan Scribe: Ryan O'Donnell

Lecturer : Madhu Sudan Scribe : Anastasios Sidiropoulos 1 Overview

n Proof Assume that m > 2n. We define vectors c̃1, . . . , c̃m ≈ R, such that for each i, with � {−1, 1} ci, and for each i, with 1 � j � n, the jth coordinate of ̃ 1 � i � n, ̃ ci is −1, iff the jth bit of ci is 1. Note that if �(ci, cj ) � n/2, then this implies →c̃i, c̃j � 0. Intuitively, this means that if two codewords ⊂ ci, and cj have large Hamming distance, then the angle between the correspo...

Analysis of Boolean Functions

Scribe notes from the 2012 Barbados Workshop on Computational Complexity. A series of lectures on Analysis of Boolean Functions by Ryan O'Donnell, with a guest lecture by Per Austrin.

Lecturer : Scott Aaronson Scribe : Tiffany Wang 1

On the Work of Madhu Sudan, Volume 50, Number 1

Madhu Sudan is the recipient of the 2002 Nevanlinna Prize. Sudan has made fundamental contributions to two major areas of research, the connections between them, and their applications. The first area is coding theory. Established by Shannon and Hamming over fifty years ago, it is the mathematical study of the possibility of, and the limits on, reliable communication over noisy media. The secon...

On the work of Madhu Sudan

Madhu Sudan is the recipient of the 2002 Nevanlinna Prize. Sudan has made fundamental contributions to two major areas of research, the connections between them, and their applications. The first area is Coding Theory. Established by Shannon and Hamming over 50 years ago, it is the mathematical study of the possibility of and the limits on reliable communication over noisy media. The second are...